Flow-chart proofs with open problems as scaffolds for learning about geometrical proofs

Proofs for Satisfiability Problems

ProofFlow: Flow Diagrams for Proofs

We present a light formalism for proofs that encodes their inferential structure, along with a system that transforms these representations into flow-chart diagrams. Such diagrams should improve the comprehensibility of proofs. We discuss language syntax, diagram semantics, and our goal of building a repository of diagrammatic representations of proofs from canonical mathematical literature. Th...

Proofs About Lists Using Ellipsis

In this paper we explore the use of ellipsis in proofs about lists. We present a higher-order formulation of elliptic formulae, and describe its implementation in the λClam proof planner. We use an unambiguous higher-order formulation of lists which is amenable to formal proofs without using induction, and to display using the familiar ... notation.

Noninterference Proofs through Flow Analysis

This note proves noninterference results (NI) for the secrecy analyses for LA and LAM presented in [1], using the inductive information ow analysis. This ow analysis is related to the secrecy typing in [1] in that, while the latter ensures safety of information ow, the former extracts ow of information. The presentation and study of ow analysis is restricted to its use in NI proofs: further stu...

Minimum-Knowledge Interactive Proofs for Decision Problems